The Number of Decomposable Univariate Polynomials
نویسنده
چکیده
A univariate polynomial f over a field is decomposable if it is the composition f = g ◦h of two polynomials g and h whose degree is at least 2. We determine an approximation to the number of decomposable polynomials over a finite field. The tame case, where the field characteristic p does not divide the degree n of f , is reasonably well understood, and we obtain exponentially decreasing error bounds. The wild case, where p divides n, is more challenging and our error bounds are weaker. A centerpiece of our approach is a decomposition algorithm in the wild case, which shows that sufficiently many polynomials are decomposable.
منابع مشابه
The number of decomposable univariate polynomials
A univariate polynomial f over a field is decomposable if it is the composition f = g ◦h of two polynomials g and h whose degree is at least 2. We determine an approximation to the number of decomposable polynomials over a finite field. The tame case, where the field characteristic p does not divide the degree n of f , is reasonably well understood, and we obtain exponentially decreasing error ...
متن کاملSurvey on Counting Special Types of Polynomials
Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gauß count the remaining ones, approximately and exactly. For polynomials in two or more variables, the situation changes dramatically. Most multivariate polynomials are irreducible. This survey presents counting results for some special classes of mu...
متن کاملDecomposable symmetric mappings between infinite dimensional spaces
Decomposable mappings from the space of symmetric k-fold tensors over E, ⊗ s,k E, to the space of k-fold tensors over F , ⊗ s,k F , are those linear operators which map nonzero decomposable elements to nonzero decomposable elements. We prove that any decomposable mapping is induced by an injective linear operator between the spaces on which the tensors are defined. Moreover, if the decomposable...
متن کاملComplexity of Algorithms for Computing Greatest Common Divisors of Parametric Univariate Polynomials
This paper presents a comparison between the complexity bounds of different algorithms for computing greatest common divisor of a finite set of parametric univariate polynomials. Each algorithm decomposes the parameters space into a finite number of constructible sets such that a greatest common divisor of the parametric univariate polynomials is given uniformly in each constructible set. The f...
متن کاملDistinct edge geodetic decomposition in graphs
Let G=(V,E) be a simple connected graph of order p and size q. A decomposition of a graph G is a collection π of edge-disjoint subgraphs G_1,G_2,…,G_n of G such that every edge of G belongs to exactly one G_i,(1≤i ≤n). The decomposition 〖π={G〗_1,G_2,…,G_n} of a connected graph G is said to be a distinct edge geodetic decomposition if g_1 (G_i )≠g_1 (G_j ),(1≤i≠j≤n). The maximum cardinality of π...
متن کامل